Neat Embedding Is Not Sufficient for Complete Representability

نویسنده

  • Tarek Sayed Ahmed
چکیده

In [4] we characterize the class of countable completey representable relation and cylindric algebras via special neat embeddings. In this note we provide a counterexample showing that the condition of countability cannot be omitted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding neat and carboxylated nanodiamonds into polypropylene membranes to enhance antifouling properties

The aim of the present work is to enhance the antifouling properties of polypropylene (PP) membrane based on hydrophilicity improvement. Different contents of neat and modified nanodiamond (0.25, 0.50, 0.75 and 1.00 wt.%) were embedded into PP membranes. Nanodiamond nanoparticles were carboxylated by heat treatment method and the presence of carboxyl functional groups on the surface of nanopart...

متن کامل

On the Representation Theory for Cylindric Algebras

The main purpose of this paper is to give some new sufficient conditions for the representability of infinite dimensional cylindric algebras. We also discuss certain problems and results in the representation theory reported on by Henkin and Tarski in [5]. In general we adopt the notation of [5]. § 1 contains some additional notation, the statement of a representation theorem of Henkin and Tars...

متن کامل

Smoothness of the Carrying Simplex for Discrete-time Competitive Dynamical Systems: A Characterization of Neat Embedding

The paper is concerned with the question of smoothness of the carrying simplex S for a discrete-time dissipative competitive dynamical system. We give a necessary and sufficient criterion for S being a C submanifold-with-corners neatly embedded in the nonnegative orthant, formulated in terms of inequalities between Lyapunov exponents for ergodic measures supported on the boundary of the orthant...

متن کامل

Quantum computational complexity of the N-representability problem: QMA complete.

We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground st...

متن کامل

Domain Representability and the Choquet Game in Moore and BCO-spaces

In this paper we investigate the role of domain representability and Scott-domain representability in the class of Moore spaces and the larger class of spaces with a base of countable order. We show, for example, that in a Moore space, the following are equivalent: domain representability; subcompactness; the existence of a winning strategy for player α (= the non-empty player) in the strong Ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007